package 刷题10月.链表;
//https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=117&&tqId=37735&rp=1&ru=/activity/oj&qru=/ta/job-code-high/question-ranking
public class NC33合并两个排序的链表1002 {

public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}
    public class Solution {
        public ListNode Merge(ListNode list1, ListNode list2) {
            ListNode head = new ListNode(0);
            ListNode movnode = head;

            while (list1 != null && list2 != null) {
                if (list1.val > list2.val) {
                    movnode.next = list2;
                    list2 = list2.next;
                } else {
                    movnode.next = list1;
                    list1 = list1.next;
                }
                movnode = movnode.next;
            }
            if (list1 != null) {
                movnode.next = list1;
            }
            if (list2 != null) {
                movnode.next = list2;
            }
            return head.next;
        }
    }
}
